Information Theoretic Cryptography for Information Theorists (Notes for a tutorial at ISIT 2017)
نویسندگان
چکیده
Randomness extraction refers to generating almost uniform bits as a function of a given random variable X. This will play a central role in all our applications, in particular, in the privacy amplification step of secret key agreement. The form of functions that can enable randomness extraction depends on the underlying class of distributions of X for which we want the extraction to work. We begin by reviewing various classes of interest.
منابع مشابه
Ieee Information Theory Society Newsletter President's Column from the Editor the 2016 Ieee Technical Field Award Recipients: Information and Communication Complexity Isit 2015 Tutorial Information and Communication Complexity Isit 2015 Tutorial
The study of interactive communication (known as communication complexity in the computer science literature) is one of the most important and successful tools for obtaining unconditional lower bounds in computational complexity. Despite its natural connection to classical communication theory, the usage of information theoretic techniques is relatively new within the study of interactive commu...
متن کاملConcentration of Measure Inequalities and Their Communication and Information-Theoretic Applications
During the last two decades, concentration of measure has been a subject of various exciting developments in convex geometry, functional analysis, statistical physics, high-dimensional statistics, probability theory, information theory, communications and coding theory, computer science, and learning theory. One common theme which emerges in these fields is probabilistic stability: complicated,...
متن کاملOn the design and security of a lattice-based threshold secret sharing scheme
In this paper, we introduce a method of threshold secret sharing scheme (TSSS) in which secret reconstruction is based on Babai's nearest plane algorithm. In order to supply secure public channels for transmitting shares to parties, we need to ensure that there are no quantum threats to these channels. A solution to this problem can be utilization of lattice-based cryptosystems for these channe...
متن کاملISIT 2015 Tutorial: Information Theory and Machine Learning
We are in the midst of a data deluge, with an explosion in the volume and richness of data sets in fields including social networks, biology, natural language processing, and computer vision, among others. In all of these areas, machine learning has been extraordinarily successful in providing tools and practical algorithms for extracting information from massive data sets (e.g., genetics, mult...
متن کاملLinear inverse problems on Erdős-Rényi graphs: Information-theoretic limits and efficient recovery
This paper considers the linear inverse problem Y = AX ⊕ Z, where A is the incidence matrix of an Erdős-Rényi graph, Z is an i.i.d. noise vector, and X is the vector of unknown variables, assumed to be Boolean. This model is motivated by coding, synchronization, and community detection problems. Without noise, exact recovery is possible if and only the graph is connected, with a sharp threshold...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017